An Introduction to Cryptology
نویسنده
چکیده
This paper provides an overview of the state of the art in the design of cryptographic algorithms. It reviews the different type of algorithms for encryption and authentication and explains the principles of stream ciphers, block ciphers, hash functions, public-key encryption algorithms, and digital signature schemes. Subsequently the design and evaluation procedures for cryptographic algorithms are discussed.
منابع مشابه
Stream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملComplexity Theory and Cryptology. An Introduction to Cryptocomplexity
In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important thing but also for daily activities. Many people now, from any level can use internet. The sources of internet connection can also be enjoyed in many places. As one of the benefits is to get the on-line complexity theory and cryptology an introduction to cryptocomplexit...
متن کاملAn introduction to computable model theory on groups and fields
We introduce the standard computable-model-theoretic concepts of a computable group and a computable field, and use them to illustrate the sorts of questions about groups and fields which computability theorists investigate. This article is intended for group theorists with some background in algorithmic questions, such as the undecidability of the word problem and the conjugacy problem for fin...
متن کاملA Cryptographic Analysis of the TLS 1.3 draft-10 Full and Pre-shared Key Handshake Protocol
We analyze the handshake protocol of TLS 1.3 draft-ietf-tls-tls13-10 (published October 2015). This continues and extends our previous analysis (CCS 2015, Cryptology ePrint Archive 2015) of former TLS 1.3 drafts (draft-ietf-tls-tls13-05 and draft-ietf-tls-tls13-dh-based). Here we show that the full (EC)DHE Diffie–Hellman-based handshake of draft-10 is also secure in the multi-stage key exchange...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملSolving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems
This paper is a tutorial introduction to the present state-of-the-art in the field of security of latticebased cryptosystems. After a short introduction to lattices, we describe the main hard problems in lattice theory that cryptosystems base their security on, and we present the main methods of attacking these hard problems, based on lattice basis reduction. We show how to find shortest vector...
متن کامل